Geodesic Affinity Propagation Clustering Based on Angle-Based Outlier Factor
نویسندگان
چکیده
The affinity propagation (AP) clustering algorithm has received a lot of attention over the past few years. AP is efficient and insensitive to initialization, generates results with lower error in less time. However, there are still two key limitations: AP-related algorithms cannot identify outliers clusters. And they usually not ideal for processing nonlinear data. To address above issues, we propose geodesic based on angle-based outlier factor (ABOF-GAP). First, identified according value factor. Besides, Euclidean distance replaced measure similarity. Experiments synthetic data real illustrate effectiveness ABOF-GAP algorithm.
منابع مشابه
Affinity Propagation Clustering Using Path Based Similarity
Clustering is a fundamental task in data mining. Affinity propagation clustering (APC) is an effective and efficient clustering technique that has been applied in various domains. APC iteratively propagates information between affinity samples, updates the responsibility matrix and availability matrix, and employs these matrices to choose cluster centers (or exemplars) of respective clusters. H...
متن کاملBattery Grouping with Time Series Clustering Based on Affinity Propagation
Battery grouping is a technology widely used to improve the performance of battery packs. In this paper, we propose a time series clustering based battery grouping method. The proposed method utilizes the whole battery charge/discharge sequence for battery grouping. The time sequences are first denoised with a wavelet denoising technique. The similarity matrix is then computed with the dynamic ...
متن کاملDistributed and Incremental Clustering Based on Weighted Affinity Propagation
A new clustering algorithm Affinity Propagation (AP) is hindered by its quadratic complexity. The Weighted Affinity Propagation (WAP) proposed in this paper is used to eliminate this limitation, support two scalable algorithms. Distributed AP clustering handles large datasets by merging the exemplars learned from subsets. Incremental AP extends AP to online clustering of data streams. The paper...
متن کاملAn Improved PSO Clustering Algorithm Based on Affinity Propagation
-Particle swarm optimization (PSO) is undoubtedly one of the most widely used swarm intelligence algorithm. Generally, each particle is assigned an initial value randomly. In this paper an improved PSO clustering algorithm based on affinity propagation (APPSO) is proposed which provides new ideas and methods for cluster analysis. Firstly the proposed algorithm get initial cluster centers by aff...
متن کاملA parallel attribute reduction algorithm based on Affinity Propagation clustering
As information technology is developing rapidly, massive and high dimensional data sets have appeared in abundance. The existing attribute reduction methods are encountering bottleneck problem of timeliness and spatiality. AP(Affinity Propagation) is an efficient and fast clustering algorithm for large dataset compared with the existing clustering algorithms. This paper discusses attribute clus...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2023
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2023.3271996